On stable set polyhedra for K1,3-free graphs
نویسندگان
چکیده
منابع مشابه
Composition of stable set polyhedra
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph minus an edge and use the new theorem to derive a class of facets. 1 Preliminaries and Introduction Let G = (V, E) be a simple undirected graph. A set S ⊆ V of pairwise nonadjacent vertices defines a stable set. Let S...
متن کاملOn the Stable Set Polytope of Claw-Free Graphs
In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...
متن کامل2-clique-bond of stable set polyhedra
The 2-bond is a generalization of the 2-join where the subsets of nodes that are connected on each shore of the partition are not necessarily disjoint. If all the subsets are cliques we say that the 2-bond is a 2-clique-bond. We consider a graph G obtained as the 2-clique-bond of two graphs G1 and G2 and we study the polyhedral properties of the stable set polytope associated with this graph. I...
متن کاملMaximum Weight Stable Set in ($P_7$, bull)-free graphs
We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce). With the same arguments with also give a polynomial algorithm for any graph that does not contain S1,2,3 or a bull.
متن کاملP5-free augmenting graphs and the maximum stable set problem
The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we 3rst propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90033-2